The cyclic production routing problem

This paper introduces the Cyclic Production Routing Problem (CPRP). The CPRP is an extension of well-known NP-hard (PRP), which a hard-to-solve combinatorial optimisation problem with numerous practical applications in field freight transportation, logistics and supply chain management. Under PRP setting, manufacturer responsible for determining production decisions, as well timing quantity replenishment services offered to set geographically dispersed customers over multi-period time horizon. calls jointly optimising production, inventory, distribution routing decisions. In this paper, basic model modified generate repeatable cyclic delivery schedules. A two-commodity flow formulation proposed along valid inequalities. Extensive comparisons between variant on benchmark instances are provided. new significantly harder solve, especially when vehicle fleet limited. From managerial perspective, generation production-routing schedules increases all costs, whereas number routes required implement schedule higher.